Keenness for characterizing continuous optimization problems and predicting differential evolution algorithm performance

نویسندگان

چکیده

Abstract Fitness landscape analysis devotes to characterizing different properties of optimization problems, such as evolvability, sharpness, and neutrality. Although several features have been proposed, only a few them can be used in practice predictors algorithm performance. In this study, the keenness ( $$\textrm{KEE}_{s}$$ KEE s ) is proposed characterize sharpness fitness for continuous problems predict performance differential evolution algorithm. Specifically, mirror simple random walk designed construct relevance between front back search points sampling. The value each point replaced by specific integer. values set integers with same circumstance are computed feature scalar using cumulative calculation mechanism. results experimental studies various functions demonstrate superiority terms accuracy, reliability, coverage samples. Moreover, has shown excellent practicability application prediction problems. Thus, new within limited prior knowledge unknown problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well Placement Optimization Using Differential Evolution Algorithm

Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...

متن کامل

A Differential Evolution Algorithm for Continuous Function Optimization

This paper presents a differential evolution algorithm to solve continuous function optimization problems. The algorithm was tested using 14 newly proposed benchmark instances in Congress on Evolutionary Computation 2005. For these benchmark problems, the problem definition files, codes and evaluation criteria are available in http://www.ntu.edu.sg/home/EPNSugan. Since these benchmarks are newl...

متن کامل

Differential Evolution Algorithm for Solving Multi-objective Optimization Problems

This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...

متن کامل

An Improved Differential Evolution Algorithm for Multi-objective Optimization Problems

In this paper, an improved multi-objective differential evolution algorithm(IDEA) is proposed for multi-objective optimization problems. In IDEA, the select operator combines the advantages of DE with the mechanisms of Pareto-based ranking and distance density, besides, a randomly migration strategy is proposed. IDEA is implemented on four classical multi-objective problems, the simulation resu...

متن کامل

A Robust Archived Differential Evolution Algorithm for Global Optimization Problems

A robust archived differential evolution algorithm is put forward by means of embedding a flexibility processing operator and an efficiency processing operator based on original DE and ADE. A special constraint-handling mechanism based on dynamic penalty functions and fitness calculation of individuals is adopted in the proposed method to deal with various constraints effectively, which is furt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2023

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-023-01005-7